3 D Binary Fast Morphological
نویسندگان
چکیده
In this paper the use of a fast algorithm for implementing shape decomposition of 3D binary objects is proposed. Shape decomposition is performed by successive 3D erosions and dilations, using 3D structuring elements of arbitrary size and shape. The proposed fast shape decomposition algorithm is based on a fast implementation of the basic morphological operation of Minkowski addition for the special case of binary 3D images (binary volumes). Experiments that evaluate the use of several structuring elements are also presented. The use of 2D and 1D structur-ing elements is also proposed to minimize the error of the reconstructed object.
منابع مشابه
A fast implementation of 3-D binary morphological transformations
This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional (3-D) images, using 3-D structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition. The eff...
متن کاملFast Implementation Of Morphological Operations Using Binary Image Block Decomposition
Morphological transformations are commonly used to perform a variety of image processing tasks. However, morphological operations are time-consuming procedures since they involve ordering and min/max computation of numbers resulting from image interaction with structuring elements. This paper presents a new method that can be used to speed up basic morphological operations for binary images. To...
متن کاملMorphological skeleton representation and coding of binary images
This paper presents the results of a study on the use of morphological set operations to represent and encode a discrete binary image by parts of its skeleton, a thinned version of the image containing complete information about its shape and size. Using morphological erosions and openings, a finite image can be uniquely decomposed into a finite number of skeleton subsets and then the image can...
متن کاملSegmentation in Color Image on the Basis of Morphological Clustering
By using classification in 3-D color space, we represent a method to segment color images. In the ordinary 3-D images, the cluster appears in its histograms do not fit in well-known statistical model. For this reason, we have a classifier that depends on mathematical Morphology, and mostly we use watershed algorithm. By this method we can show the expected color clusters accurately on various i...
متن کاملFacial expression recognition based on Local Binary Patterns
Classical LBP such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. In this paper, we introduce an improved LBP algorithm to solve these problems that utilizes Fast PCA algorithm for reduction of vector dimensions of extracted features. In other words, proffer method (Fast PCA+LBP) is an improved LBP algorithm that is extracted ...
متن کامل